

# def dfs(depth):
#     if depth == n:
#         for i in range(1, n):
#             if path[i] < path[i-1]:
#                 return
#         if sum(path) != x:
#             return
#         print(*path)
#         return
#
#     for i in range(1, x+1):
#         path[depth] = i
#         dfs(depth + 1)


def dfs(depth, lastvalue):
    if depth == n:
        if sum(path) != x:
            return
        print(*path)
        return
#from last loop's end
    for i in range(lastvalue, x+1):
        path[depth] = i
        dfs(depth + 1, i)




x =int(input())
n = int(input())
path = [0] * n
dfs(0, 1)